PRIMME_SVDS: A High-Performance Preconditioned SVD Solver for Accurate Large-Scale Computations
نویسندگان
چکیده
The increasing number of applications requiring the solution of large scale singular value problems has rekindled an interest in iterative methods for the SVD. Some promising recent advances in large scale iterative methods are still plagued by slow convergence and accuracy limitations for computing smallest singular triplets. Furthermore, their current implementations in MATLAB cannot address the required large problems. Recently, we presented a preconditioned, two-stage method to effectively and accurately compute a small number of extreme singular triplets. In this research , we present a high-performance library, PRIMME SVDS, that implements our hybrid method based on the state-of-the-art eigensolver package PRIMME for both largest and smallest singular values. PRIMME SVDS fills a gap in production level software for computing the partial SVD, especially with preconditioning. The numerical experiments demonstrate its superior performance compared to other state-of-the-art software and its good parallel performance under strong and weak scaling.
منابع مشابه
A preconditioned solver for sharp resolution of multiphase flows at all Mach numbers
A preconditioned five-equation two-phase model coupled with an interface sharpening technique is introduced for simulation of a wide range of multiphase flows with both high and low Mach regimes. Harten-Lax-van Leer-Contact (HLLC) Riemann solver is implemented for solving the discretized equations while tangent of hyperbola for interface capturing (THINC) interface sharpening method is applied ...
متن کاملPRIMME_SVDS: A Preconditioned SVD Solver for Computing Accurately Singular Triplets of Large Matrices based on the PRIMME Eigensolver
The computation of a few singular triplets of large, sparse matrices is a challenging task, especially when the smallest magnitude singular values are needed in high accuracy. Most recent efforts try to address this problem through variations of the Lanczos bidiagonalization method, but algorithmic research is ongoing and without production level software. We develop a high quality SVD software...
متن کاملNew Fast and Accurate Jacobi Svd Algorithm: Ii. Lapack Working Note 170
This paper presents new implementation of one–sided Jacobi SVD for triangular matrices and its use as the core routine in a new preconditioned Jacobi SVD algorithm, recently proposed by the authors. New pivot strategy exploits the triangular form and uses the fact that the input triangular matrix is the result of rank revealing QR factorization. If used in the preconditioned Jacobi SVD algorith...
متن کاملNew Fast and Accurate Jacobi SVD Algorithm. II
This paper presents new implementation of one–sided Jacobi SVD for triangular matrices and its use as the core routine in a new preconditioned Jacobi SVD algorithm, recently proposed by the authors. New pivot strategy exploits the triangular form and uses the fact that the input triangular matrix is the result of rank revealing QR factorization. If used in the preconditioned Jacobi SVD algorith...
متن کاملSolving large systems arising from fractional models by preconditioned methods
This study develops and analyzes preconditioned Krylov subspace methods to solve linear systems arising from discretization of the time-independent space-fractional models. First, we apply shifted Grunwald formulas to obtain a stable finite difference approximation to fractional advection-diffusion equations. Then, we employee two preconditioned iterative methods, namely, the preconditioned gen...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- SIAM J. Scientific Computing
دوره 39 شماره
صفحات -
تاریخ انتشار 2017